Grid-enabled Probabilistic Model Checking with PRISM∗

نویسندگان

  • Yi Zhang
  • David Parker
  • Marta Kwiatkowska
چکیده

In this paper, we present our work on extending the probabilistic model checking tool PRISM with Grid computing capabilities. PRISM is a tool for the verification and analysis of large, probabilistic models, a process which involves numerical solution techniques. Like most verification tools, PRISM can be very resource intensive and will benefit greatly from parallelisation efforts. Grid computing provides an invaluable means through which to invoke parallel numerical solution engines in PRISM, providing support for job distribution, data transfer and task monitoring on large-scale parallel and distributed computing environments. We describe the middleware we are developing to integrate this functionality into PRISM and illustrate its use on large model checking case study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Randomized Distributed Algorithms with PRISM?

In this paper we describe our experience with model checking randomized distributed algorithms using PRISM, a symbolic model checker for concurrent probabilistic systems currently being developed. PRISM uses Multi-Terminal Binary Decision Diagrams (MTBDDs) as supplied by the CUDD package of Fabio Somenzi. Implemented in Java, PRISM has a system description language similar to Reactive Modules a...

متن کامل

Stochastic Model Checking

This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying DTMCs and CTMCs against specifications written in probabilistic extensions of temporal logic, including quantitative properties with rewards. Example properties include the probability that a fault occurs and the expected n...

متن کامل

Probabilistic Temporal Logic or: With What Probability Will the Swedish Chef Bork the Meatballs?

In this paper we motivate, define and explain a probabilistic extension to CTL*, namely pCTL*. We provide examples to prove the expressive power of the probabilistic operator, as well as demonstrate the inadequacy of CTL* in dealing with real life systems. Finally, we give a brief overview of model checking for probabilistic systems and the PRISM model checker.

متن کامل

Probabilistic Model Checking for Games of imperfect information

It has been recognised for some time that there are close links between the various logics developed for the analysis of multi-agent systems and the many gametheoretic models developed for the same purpose. In this paper, we contribute to this burgeoning body of work by showing how a probabilistic model checking tool can be used for the automated analysis of game-like multi-agent systems in whi...

متن کامل

Probabilistic model checking of IEEE 802.11 IBSS power save mode

The IEEE 802.11 standard for wireless local area network defines a power management algorithm for Independent Basic Service Set (IBSS). The wireless stations that form an IBSS communication mode create ad-hoc connections between themselves and communicate with each other through a contention based channel access mechanism. The wireless stations in IBSS are typically battery enabled low power de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005